Dynamic Operation of Peer-to-Peer Overlay Networks
نویسندگان
چکیده
Virtual overlay networks, such as virtual private networks or peer-to-peer services, can be seen as a new paradigm for providing multi-service networks. Virtual overlay networks may offer customized services to a specified community while providing a high degree of flexibility in the usage of shared resources. This paper examines the requirements of operating dynamic overlays, in particular, for peer-to-peer services. The analysis is based on extensive measurement studies performed on the global Gnutella network during operation. The obtained results indicate limitations in scalability of native p2p overlays, suggesting the need of a control scheme for efficiency reasons. As an enabling infrastructure to implement a distributed control scheme for p2p overlays a so-called ApplicationLayer Active Networking (ALAN) platform has been chosen. Based on Application-Layer Active Networking, Active Virtual Peers (AVP) are introduced as the main concept for dynamic operation and management of peer-to-peer overlay networks. AVPs facilitate policy enforcement or performance management by means of self-organization, predominantly on the application layer with minimum interference on lower layers.
منابع مشابه
A distributed adaptive landmark clustering algorithm based on mOverlay and learning automata for topology mismatch problem in unstructured peer-to-peer networks
Peer-to-peer networks are overlay networks that are built on top of communication networks that are called underlay networks. In these networks, peers are unaware of the underlying networks, so the peers choose their neighbors without considering the underlay positions, and therefore, the resultant overlay network may have mismatches with its underlying network, causing redundant end-to-end del...
متن کاملVerifying a Structured Peer-to-Peer Overlay Network: The Static Case
Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communication network. In this paper, we formally verify a typical application running on a fixed set of nodes. This work is the foundation for studies of a more dynamic system. We identify a value and expression language for a value-p...
متن کاملHierarchical Structured Peer-to-Peer Networks
Structured peer-to-peer systems or distributed hash tables (DHT) are self-organizing distributed systems designed to support efficient and scalable lookups with dynamic network topology changes. Nodes are organized as structured overlay networks, and data is mapped to nodes in the overlap network based on their identifier. There are two main types of structured peer-to-peer architectures: flat ...
متن کاملP3ON: Proximity-based Peer-to-Peer Overlay Networks
Peer-to-peer(P2P) overlay networks provide robust, scalable file sharing services. The hop distance between two virtual nodes in P2P overlay networks is irrelevant to the real distance between two nodes. Therefore, many lookup operations may be executed, without considering the real distance, even though a node wants to find a file object located in another node within the same subnet. To overc...
متن کاملRandom Graphs for Peer-to-Peer Overlays
Modern peer-to-peer networks consist of several network layers and distributed algorithms providing features like indexing, ressource balancing, entry protocols, security, anonymity, and cryptography. Since peer-to-peer networks are highly dynamic, a fundamental task in the design of these networks is to provide high connectivity. We propose a solution by distributed random link exchange algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Praxis der Informationsverarbeitung und Kommunikation
دوره 26 شماره
صفحات -
تاریخ انتشار 2003